Power-law scaling for the adiabatic algorithm for search-engine ranking
نویسندگان
چکیده
Adam Frees,1 John King Gamble,2 Kenneth Rudinger,2 Eric Bach,3 Mark Friesen,2,* Robert Joynt,2 and S. N. Coppersmith2,† 1Department of Physics, Brown University, Providence, Rhode Island 02912, USA 2Department of Physics, University of Wisconsin-Madison, Madison, Wisconsin 53706, USA 3Department of Computer Sciences, University of Wisconsin-Madison, Madison, Wisconsin 53706, USA (Received 11 December 2012; published 5 September 2013)
منابع مشابه
A New Hybrid Method for Web Pages Ranking in Search Engines
There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...
متن کاملWeb pages ranking algorithm based on reinforcement learning and user feedback
The main challenge of a search engine is ranking web documents to provide the best response to a user`s query. Despite the huge number of the extracted results for user`s query, only a small number of the first results are examined by users; therefore, the insertion of the related results in the first ranks is of great importance. In this paper, a ranking algorithm based on the reinforcement le...
متن کاملAdiabatic quantum algorithm for search engine ranking.
We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web page...
متن کاملSimulation of Quantum Adiabatic Search in the Presence of Noise
Results are presented of a large-scale simulation of the quantum adiabatic search (QuAdS) algorithm in the presence of noise. The algorithm is applied to the NP–Complete problem N–Bit Exact Cover 3 (EC3). The noise is assumed to Zeeman-couple to the qubits and its effects on the algorithm’s performance is studied for various levels of noise power, and for 4 different types of noise polarization...
متن کاملRRLUFF: Ranking function based on Reinforcement Learning using User Feedback and Web Document Features
Principal aim of a search engine is to provide the sorted results according to user’s requirements. To achieve this aim, it employs ranking methods to rank the web documents based on their significance and relevance to user query. The novelty of this paper is to provide user feedback-based ranking algorithm using reinforcement learning. The proposed algorithm is called RRLUFF, in which the rank...
متن کامل